\begin{frontmatter}

\thanks[sticamsud]{\scriptsize Partially supported by the STIC/AmSud
joint program by CAPES (Brazil), CNRS and MAE (France), CONICYT (Chile) and
MINCyT (Argentina) and the Pronem program by FUNCAP/CNPq
(Brazil).}

\title{A Strengthened General Cut-Generating Procedure for the Stable Set
Polytope\thanksref{sticamsud}}

\author{Ricardo C. Corrêa%
% \thanksref{emailricardo}
%\thanksref{pargo}
}

\address{%
Departamento de Computação, Universidade Federal do Ceará, Fortaleza, CE, Brazil.
\href{mailto:{pmsf,correa}@lia.ufc.br}
     {\texttt{\normalshape correa@lia.ufc.br}}.%
}

\author{Javier Marenco},
\author{Diego Delle Donne},
\author{Ivo Koch}

\address{%
Universidad Nacional de General Sarmiento, Buenos Aires, Argentina.
\href{mailto:{jmarenco,ddelledo,ikoch}@ungs.edu.ar}
     {\texttt{\normalshape \{jmarenco,ddelledo,ikoch\}@ungs.edu.ar}}.%
}

% \thanks[emailricardo]{Email:
%   \href{mailto:correa@lia.ufc.br}
%        {\texttt{\normalshape correa@lia.ufc.br}}.}

%\thanks[pargo]{ParGO Research Group: \url{http://lia.ufc.br/~pargo}.}


\begin{abstract}
In a previous work we have presented a general procedure for generating rank and non-rank valid inequalities for the stable set polytope. 
%This is accomplished by iteratively solving a lifting problem, which consists
% of a maximum weighted stable set problem on a smaller graph. 
In this work we propose an improvement over this procedure.
Computational experience on random and DIMACS benchmark instances shows that the
proposed approach allows to obtain tighter upper bounds for the maximum stable
set problem.
\end{abstract}

\begin{keyword}
Facets of polyhedra, clique projection, stable set polytope
\end{keyword}

\end{frontmatter}
